Algorithms for the parallel alternating direction access machine
نویسندگان
چکیده
منابع مشابه
Algorithms for the parallel alternating direction access machine
We describe a number of algorithms for the model for parallel computation called Parallel Alternating-Direction Access Machine (padam). This model has the memory modules of the global memory arranged as a 2-dimensional array, with each processor assigned to a row and a column, the processors can switch synchronously between row and column access modes. We study the issues of inter-processor com...
متن کاملParallel Alternating-Direction Access Machine
This paper presents a theoretical study of a model of parallel computations called Parallel Alternating-Direction Access Machine (padam). padam is an abstraction of the multiprocessor computers adena /adenart and a prototype architecture usc/omp. The main feature of padam is the organization of access to the global memory: (1) the memory modules are arranged as a 2-dimensional array, (2) each p...
متن کاملParallel Alternating - Direction Access Machine ? Bogdan
This paper presents a theoretical study of a model of parallel computations called Parallel Alternating-Direction Access Machine (padam). padam is an abstraction of the multiprocessor computers adena /adenart and a prototype architecture usc/omp. The main feature of padam is the organization of access to the global memory: (1) the memory modules are arranged as a 2-dimensional array, (2) each p...
متن کاملParallel Algorithms for Constrained Tensor Factorization via the Alternating Direction Method of Multipliers
Tensor factorization has proven useful in a wide range of applications, from sensor array processing to communications, speech and audio signal processing, and machine learning. With few recent exceptions, all tensor factorization algorithms were originally developed for centralized, in-memory computation on a single machine; and the few that break away from this mold do not easily incorporate ...
متن کاملA parallel alternating direction implicit preconditioning method *
Jiang, H. and Y.S. Wong, A parallel alternating direction implicit preconditioning method, Journal of Computational and Applied Mathematics 36 (1991) 209-226. The alternating direction implicit (ADI) iterative method is an efficient iterative method to solve systems of linear equations due to its extremely fast convergence. The AD1 method has also been used successfully as a preconditioner in s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00280-7